| |
|
|
| Registros recuperados : 254 | |
| Registros recuperados : 254 | |
|
|
|
Registro Completo
|
Biblioteca(s): |
Embrapa Agricultura Digital; Embrapa Arroz e Feijão. |
|
Data corrente: |
06/12/2011 |
|
Data da última atualização: |
12/12/2011 |
|
Tipo da produção científica: |
Resumo em Anais de Congresso |
|
Autoria: |
NARCISO, M.; YAMAGISHI, M. |
|
Afiliação: |
MARCELO GONCALVES NARCISO, CNPAF; MICHEL EDUARDO BELEZA YAMAGISHI, CNPTIA. |
|
Título: |
A fast algorithm to "de novo" genome wide tandem repeats discovery. |
|
Ano de publicação: |
2011 |
|
Fonte/Imprenta: |
In: INTERNATIONAL CONFERENCE OF THE BRAZILIAN ASSOCIATION FOR BIOINFORMATICS AND COMPUTATIONAL BIOLOGY, 7.; INTERNATIONAL CONFERENCE OF THE IBEROAMERICAN SOCIETY FOR BIOINFORMATICS, 3., 2011, Florianópolis. Proceedings... Florianópolis: Associação Brasileira de Bioinformática e Biologia Computacional, 2011. |
|
Idioma: |
Inglês |
|
Notas: |
X-MEETING 2011. |
|
Conteúdo: |
Tandem Repeats (TR) are sequences where the same pattern repeats consecutively. They have been used as genomic markers (microsatellite and minisatéllite) since the begining of the genomic era. Recently, new studies have associated TR to important regulatory processes which substantialy increased the interest in TR. The exponential reduction cost of sequencing caused by the new technologies, resulted in the proliferation of genome projects, and particularly of novel model organisms. Very often, the first sequence analysis is the identification of genetic markers such as SNPs and TRs. As the former is a by product of the assembly phase, the real chalenge resides in the latter since the TRs identification must be done de novo. This scenario requires a faster and more efficient algorithms to perform de novo TR discovery. In this paper, we propose a new strategy to address this problem. Our algorithm is able to deal with large genomes in a reduced computational time (on average 30% to 50% faster than other the approaches). Furthermore, our algorithm finds all TR in a genome while some popular algorithms do not as will be shown. Consequently, as our algorithm is faster and find all TR, it may be used in new genomes and old genomes as well to discover eventually missed TR. |
|
Palavras-Chave: |
Algoritmo; Marcadores genéticos; Polimorfismo de nucleotídeo único; Repetições em Tandem. |
|
Thesaurus NAL: |
Algorithms; Genetic markers; Microsatellite repeats; Single nucleotide polymorphism; Tandem repeat sequences. |
|
Categoria do assunto: |
--
X Pesquisa, Tecnologia e Engenharia |
|
URL: |
https://ainfo.cnptia.embrapa.br/digital/bitstream/item/49983/1/denovo.pdf
https://ainfo.cnptia.embrapa.br/digital/bitstream/item/49454/1/denovo.pdf
|
|
Marc: |
LEADER 02292nam a2200241 a 4500
001 1909360
005 2011-12-12
008 2011 bl uuuu u00u1 u #d
100 1 $aNARCISO, M.
245 $aA fast algorithm to "de novo" genome wide tandem repeats discovery.$h[electronic resource]
260 $aIn: INTERNATIONAL CONFERENCE OF THE BRAZILIAN ASSOCIATION FOR BIOINFORMATICS AND COMPUTATIONAL BIOLOGY, 7.; INTERNATIONAL CONFERENCE OF THE IBEROAMERICAN SOCIETY FOR BIOINFORMATICS, 3., 2011, Florianópolis. Proceedings... Florianópolis: Associação Brasileira de Bioinformática e Biologia Computacional$c2011
500 $aX-MEETING 2011.
520 $aTandem Repeats (TR) are sequences where the same pattern repeats consecutively. They have been used as genomic markers (microsatellite and minisatéllite) since the begining of the genomic era. Recently, new studies have associated TR to important regulatory processes which substantialy increased the interest in TR. The exponential reduction cost of sequencing caused by the new technologies, resulted in the proliferation of genome projects, and particularly of novel model organisms. Very often, the first sequence analysis is the identification of genetic markers such as SNPs and TRs. As the former is a by product of the assembly phase, the real chalenge resides in the latter since the TRs identification must be done de novo. This scenario requires a faster and more efficient algorithms to perform de novo TR discovery. In this paper, we propose a new strategy to address this problem. Our algorithm is able to deal with large genomes in a reduced computational time (on average 30% to 50% faster than other the approaches). Furthermore, our algorithm finds all TR in a genome while some popular algorithms do not as will be shown. Consequently, as our algorithm is faster and find all TR, it may be used in new genomes and old genomes as well to discover eventually missed TR.
650 $aAlgorithms
650 $aGenetic markers
650 $aMicrosatellite repeats
650 $aSingle nucleotide polymorphism
650 $aTandem repeat sequences
653 $aAlgoritmo
653 $aMarcadores genéticos
653 $aPolimorfismo de nucleotídeo único
653 $aRepetições em Tandem
700 1 $aYAMAGISHI, M.
Download
Esconder MarcMostrar Marc Completo |
|
Registro original: |
Embrapa Arroz e Feijão (CNPAF) |
|
|
Biblioteca |
ID |
Origem |
Tipo/Formato |
Classificação |
Cutter |
Registro |
Volume |
Status |
Fechar
|
| Nenhum registro encontrado para a expressão de busca informada. |
|
|
